graph base metric empir risk minim speed activ learn network data sofu macskassi activ semi supervis learn import techniqu label data scarc recent method suggest combin activ learn semi supervis learn algorithm gaussian field harmon function classifi relat natur reli data present partial label graph network learn problem work show empir risk minim erm method find instanc label provid effici comput erm semi supervis classifi comput problem erm reli comput risk instanc limit candid investig speed activ learn consider case data graphic natur leverag graph structur rapidli identifi instanc good candid label paper describ hybrid approach commun find social network analyt central measur identifi good candid label erm find instanc candid set show real world data limit erm comput fraction instanc compar perform 